Attribute Based Encryption (abe) Algorithm for Searching and Securing Encrypted Data

Cloud servers are virtual servers that can be run on cloud computing environmental and it encrypts data by a common key. Due to this accessing client through server is easy. In this paper, client can encrypt, store and search data by their own key on server. If client sends encrypted queries to the server for searching, it returns the encrypted matching data without knowing about plain text. In this algorithm, attribute based searching mechanism is used for searching data on cloud in which server is only allowed to learn the set of encrypted documents and attribute of the documents and not the keyword data. A user’s private key is associated with a set of attributes and ciphertext specifies an access policy over a defined universe of attributes within the system. Keyword: encryption, decryption, data searching. INTRODUCTION In order to store large amount of data, client outsources their data files to a cloud server. The service provider is third party, thus the data must be encrypted as data can contain personal and private information. It is a type of public key encryption in which the secret key of a user and the ciphertext depend on attributes. The decryption of a ciphertext is possible only if the set of attributes of the user key matches the attributes of the ciphertext. Server allows clients to search the data. In searching process, all the data sent back to client for decryption may be searched. Thus, existing encryption methods are not suitable to search the encrypted data directly. Also searchable symmetric encryption is not efficient. RELATED WORKS [1] In this paper, novel computing paradigm introduced serious privacy challenges in that users’ data are no longer locally possessed but stored on the remote server which belongs to a different trust domain compared with the data users This paper focuses on the privacy concerns in the secure search function performed over encrypted cloud data. In addition, the same search accuracy as the plaintext information retrieval can be realized using the state-of the-art similarity measure while search privacy is well protected. [2] In this paper, a novel secure and efficient multi-keyword similarity searchable encryption (MK Sim) that returns the matching data items in a ranked ordered manner is proposed. Proposed scheme is proved to be secure against adaptive chosen-keyword attacks. Proposed scheme is adaptive semantically secure against adversaries and able to achieve optimal sub linear search time. [3] Three application scenarios and identify the desirable security requirements are described. In this paper, two orthogonal categorizations and review the related security models for each category of SED schemes is provided. The practical issues related to SED (search in Encrypted data) schemes are analyzed. The brief analysis showed that there are a lot of potential securities issues facing SED schemes which are provably secure in their respective security models. [4] In this paper, formalize and solve the problem of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy is proposed. In proposed system, edit distance to quantify keywords similarity and develop two advanced techniques on constructing fuzzy keyword sets, which achieve optimized storage and representation overheads exploited. [5] Proposed algorithm allows the users to query over the encrypted column directly without decrypting all the records. It’s improves the performance of the system. The proposed algorithm works well in the case of range and fuzzy match queries. Proposed algorithm efficiently eliminates the limitations of the existing techniques for fuzzy match and range queries. This algorithm is efficient for searching of data whenever the retrieval of data is less than 40%of the total data. [6] The proposed scheme, guarantees top-n multi keyword retrieval over encrypted cloud data with high privacy and practical efficiency using vector space model and TRSE, where in the majority of computing work is done on the server while the user takes part in ranking. The proposed system makes the system highly scalable and minimizes information leakage. Prevents overloads by ranking the files at the user side, reducing bandwidth and protects document frequency. [7] An efficient encryption technique presented in this paper used for secure access to and storage of data on public cloud server, moving and searching encrypted data through communication channels while protecting data confidentiality. This method ensures data protection against both external and internal intruders. Data can be decrypted only with the provided by the data owner key, while public cloud server is unable to read encrypted data or queries. Answering a query does not depend on it size and done in a constant time. Data access is managed by the data owner. The proposed scheme allows unauthorized modifications detection. VOL. 11, NO. 13, JULY 2016 ISSN 1819-6608 ARPN Journal of Engineering and Applied Sciences ©2006-2016 Asian Research Publishing Network (ARPN). All rights reserved. www.arpnjournals.com 8247 [8] In this paper a security model for conjunctive keyword search over encrypted data and present the first schemes for conducting such searches securely. We propose a second scheme whose communication cost is on the order of the number of keyword fields and whose security relies on a new hardness assumption. [9] In this paper, an efficient scheme for similarity search over encrypted data is proposed. To ensure the confidentiality of the sensitive data, a rigorous security definition and prove the security of the proposed scheme under the provided definition is provided. In addition, a real world application of the proposed scheme and verify the theoretical results with empirical observations on a real dataset is provided. [10] In this paper, data encryption oncloud as well as corresponding security issues has been addressed. The proposed method incorporates two main phases: indexing and searching. Trap door and code word are the two security parameters applicable in this technique. Simulated results demonstrate that it provides fast and efficient ranking sentence search for unstructured data in original documents oncloud server. The proposed technique reduces the overhead of decryption thereby minimizing the search time to a considerable extent. [11] In this paper, the problem of exact keyword match by providing searching with fuzzy keyword is solved. Two more techniques called gram based technique which is useful for reducing the time, providing fasts searching and increase the performance by considering substring from the given string is proposed. An experimental result demonstrates the efficiency of proposed solution. [12] This paper proposes an efficient and more secure algorithm to solve the challenging problem of privacy preserving multi-keyword ranked search over encrypted cloud data (MRSE). This paper introduced the concept of keyword buffer controller that allows for quick search of documents and establishes a set of strict privacy requirements for such a secure cloud data utilization system to become a reality. [13] In this paper a proposed solution incorporate the hash table management and indexing techniques to keep track the actual data contents in terms of document features which may help for encrypting user data and identifying the user data and privacy. In this paper, a scheme for secure data accessing with maintaining its privacy by using strong cryptographic algorithm is introduced. [14] In this paper, cryptographic schemes for the problem of searching on encrypted data and provideproofs of security for the resulting crypto systems is described. The proposed methods are simple, fast (for a document of length n, the encryption and search algorithms only need O(n) stream cipher and blockcipher operations), and introduce almost no space and communication overhead. [15] This paper first explains public key encryption with keyword Search (PEKS) algorithm and then proposes an improved secure searchable encryption algorithm based on Indistinguishability under Adaptive Chosen Ciphertext Attack (IND-CCA2). The proposed searchable encryption is mathematically proven secure and it has the ability to perform a search within the encrypted data. SYSTEM MODEL In this design, the client has a collection of n data to outsource to the cloud server in the encrypted form. The encrypted data be searchable by clients encrypt data using their own keys, and then outsources encrypted data to the server. To search over the document collection for a given keyword is sent to the cloud server. After receiving the keyword, the server is responsible to search the index and return the corresponding set of encrypted documents. PROPOSED ALGORITHM DESCRIPTION The Algorithms has developed in the following modules from A to Z along with the Keys. Table-1. The proposed encryption method for searching the encrypted data directly.